Structural theory - PDFSEARCH.IO - Document Search Engine

Structural theory
Results: 914

#	Item
741	Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗ Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-02-23 11:23:03 Complexity classes Probabilistic complexity theory Structural complexity theory Arthur–Merlin protocol Karp–Lipton theorem Quantum complexity theory NP Interactive proof system IP Theoretical computer science Computational complexity theory Applied mathematics
742	Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Christian Glaßer ∗ Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 15:16:38 Complexity classes Computability theory Structural complexity theory Mathematical optimization NP-complete NP P versus NP problem Oracle machine Function Theoretical computer science Computational complexity theory Applied mathematics
743	Much Ado about Functions Alan L. Selman Department of Computer Science State University of New York at Buffalo Buffalo, NY[removed]Abstract Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 08:38:33 Structural complexity theory Complexity classes Functions and mappings Computability theory NP Multivalued function Oracle machine Time hierarchy theorem Inverse function Theoretical computer science Mathematics Computational complexity theory
744	Non-Mitotic Sets Christian Glasser∗, Alan L. Selman†, Stephen Travers‡, and Liyu Zhang§ 22nd June[removed]Abstract Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2006-06-22 10:53:44 Complexity classes Computability theory Structural complexity theory Mathematical optimization Many-one reduction NP-complete NP PP Reduction Theoretical computer science Computational complexity theory Applied mathematics
745	A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP Ashish V. Naik Alan L. Selman† Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:46:24 Complexity classes Structural complexity theory Mathematical optimization Conjectures P versus NP problem NP P Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
746	The Complexity of Unions of Disjoint Sets Christian Glaßer∗, Alan L. Selman†, Stephen Travers‡, and Klaus W. Wagner∗ Abstract This paper is motivated by the open question whether the union of two disjoint NPcomp Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2006-11-08 15:58:52 Complexity classes Computability theory NP-complete problems Structural complexity theory Polynomial hierarchy NP PP Many-one reduction Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
747	Communicating ASP and the Polynomial Hierarchy Kim Bauters1, , Steven Schockaert1, , Dirk Vermeir2 , and Martine De Cock1 1 Department of Applied Mathematics and Computer Science Add to Reading List Source URL: www.cwi.ugent.be Language: English - Date: 2011-07-25 12:41:03 Logic programming Complexity classes Structural complexity theory Boolean algebra Stable model semantics True quantified Boolean formula Answer set programming FO Polynomial hierarchy Theoretical computer science Computational complexity theory Applied mathematics
748	Redundancy in Complete Sets Christian Glaßer∗, A. Pavan†, Alan L. Selman‡, Liyu Zhang§ July 6, 2005 Abstract We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 14:54:47 Complexity classes Structural complexity theory Conjectures Mathematical optimization P versus NP problem PP NP Polynomial hierarchy P Theoretical computer science Computational complexity theory Applied mathematics
749	Microsoft Word[removed]AERA Li XX EMvsFIML 3 April 2007.doc Add to Reading List Source URL: lixiaoxu.lxxm.com Language: English - Date: 2012-12-09 04:39:51 Statistical methods Regression analysis Structural equation models Structural equation modeling Maximum likelihood Expectation–maximization algorithm Standard error Karl Gustav Jöreskog Discrepancy Statistics Estimation theory Econometrics
750	Autoreducibility, Mitoticity, and Immunity Christian Glaßer∗, Mitsunori Ogihara†, A. Pavan‡, Alan L. Selman§, Liyu Zhang¶ December 27, 2004 Abstract We show the following results regarding complete sets. Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-12-27 11:32:14 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP PP Polynomial hierarchy PSPACE-complete P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE